A Weak Tychonoff Theorem and the Axiom of Choice

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zermelo Theorem and Axiom of Choice

The article is continuation of [2] and [1], and the goal of it is show that Zermelo theorem (every set has a relation which well orders it proposition (26)) and axiom of choice (for every non-empty family of non-empty and separate sets there is set which has exactly one common element with arbitrary family member proposition (27)) are true. It is result of the Tarski’s axiom A introduced in [5]...

متن کامل

Contextuality and the Weak Axiom in the Theory of Choice

Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks to economics. First we construct a empirical model of choice, where choices are understood as observable outcomes in a certain sense. An analysis of contextua...

متن کامل

‘Regular’ Choice and the Weak Axiom of Stochastic Revealed Preference

We explore the relation between two 'rationality conditions' for stochastic choice behavior: regularity and the weak axiom of stochastic revealed preference (WASRP). We show that WASRP implies regularity, but the converse is not true. We identify a restriction on the domain of the stochastic choice function, which suffices for regularity to imply WASRP. When the universal set of alternatives is...

متن کامل

A Proof of the Schauder - Tychonoff Theorem

We present a new proof of the version of the Shauder-Tychonov theorem provided by Coppel in Stability and Asymptotic Behavior of Differential Equations, Heath Mathematical Monographs, Boston (1965). Our alternative proof mainly relies on the Schauder fixed point theorem.

متن کامل

Computing with Sequences, Weak Topologies and the Axiom of Choice

We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines. We prove that under the Axiom of Choice non-separable normed spaces cannot even be admissibly represented with respect to any compatible topology (a compatible topology is one which makes all bounded linear function...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1962

ISSN: 0002-9939

DOI: 10.2307/2034170